Computing unstructured and structured polynomial pseudospectrum approximations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eigenvalues, Pseudospectrum and Structured Perturbations

We investigate the behavior of eigenvalues under structured perturbations. We show that for many common structures such as (complex) symmetric, Toeplitz, symmetric Toeplitz, circulant and others the structured condition number is equal to the unstructured condition number for normwise perturbations, and prove similar results for real perturbations. An exception are complex skewsymmetric matrice...

متن کامل

Sparse spectral approximations for computing polynomial functionals

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions that turns out to be satisfied in many cases, including the Fourier and Hermite basis. MSC numbers: 65D15, 65M70, 33C45.

متن کامل

Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points

Abstract. The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented. The algorithms are inspired by those considered in [GO11] for the unstructured case, but their extension to structured pseudospectra and analysis pr...

متن کامل

Computing f(A)b via Least Squares Polynomial Approximations

Given a certain function f , various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly computing the matrix f(A). Such methods were typically developed for a specific function f , a common case being that of the exponential. This paper discusses a procedure based on least squares polynomials that can, in p...

متن کامل

Nonparametric Regression Estimation under Kernel Polynomial Model for Unstructured Data

The nonparametric estimation(NE) of kernel polynomial regression (KPR) model is a powerful tool to visually depict the effect of covariates on response variable, when there exist unstructured and heterogeneous data. In this paper we introduce KPR model that is the mixture of nonparametric regression models with bootstrap algorithm, which is considered in a heterogeneous and unstructured framewo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2019

ISSN: 0377-0427

DOI: 10.1016/j.cam.2018.09.033